3 research outputs found

    Modeling Framework and Solution Methodologies for On-Demand Mobility Services With Ridesharing and Transfer Options

    Get PDF
    The growing complexity of the urban travel pattern and its related traffic congestion, along with the extensive usage of mobile phones, invigorated On-Demand Mobility Services (ODMS) and opened the door to the emergence of Transportation Network Companies (TNC). By adopting the shared economy paradigm, TNCs enable private car owners to provide transportation services to passengers by providing user-friendly mobile phone applications that efficiently match passengers to service providers. Considering the high level of flexibility, convenience, and reliability of ODMS, compared to those offered by traditional public transportation systems, many metropolitan areas in the United States and abroad have reported rapid growth of such services. This dissertation presents a modeling framework to study the operation of on-demand mobility services (ODMS) in urban areas. The framework can analyze the operation of ODMS while representing emerging services such as ridesharing and transfer. The problem is formulated as a mixed-integer program and an efficient decomposition-based methodology is developed for its solution. This solution methodology aims at solving the offline version of the problem, in which the passengers’ demand is assumed to be known ii for the entire planning horizon. The presented approach adopts a modified column generation algorithm, which integrates iterative decomposition and network augmentation techniques to analyze networks with moderate size. Besides, a novel methodology for integrated ride-matching and vehicle routing for dynamic (online) ODMS with ridesharing and transfer options is developed to solve the problem in real-time. The methodology adopts a hybrid heuristic approach, which enables solving large problem instances in near real-time, where the passengers’ demand is not known a priori. The heuristic allows to (1) promptly respond to individual ride requests and (2) periodically re-evaluate the generated solutions and recommend modifications to enhance the overall solution quality by increasing the number of served passengers and total profit of the system. The outcomes of experiments considering hypothetical and real-world networks are presented. The results show that the modified column generation approach provides a good quality solution in less computation time than the CPLEX solver. Additionally, the heuristic approach can provide an efficient solution for large networks while satisfying the real-time execution requirements. Additionally, investigation of the results of the experiments shows that increasing the number of passengers willing to rideshare and/or transfer increases the general performance of ODMS by increasing the number of served passengers and associated revenue and reducing the number of needed vehicles

    Modeling Framework and Solution Methodologies for On-Demand Mobility Services With Ridesharing and Transfer Options

    Get PDF
    The growing complexity of the urban travel pattern and its related traffic congestion, along with the extensive usage of mobile phones, invigorated On-Demand Mobility Services (ODMS) and opened the door to the emergence of Transportation Network Companies (TNC). By adopting the shared economy paradigm, TNCs enable private car owners to provide transportation services to passengers by providing user-friendly mobile phone applications that efficiently match passengers to service providers. Considering the high level of flexibility, convenience, and reliability of ODMS, compared to those offered by traditional public transportation systems, many metropolitan areas in the United States and abroad have reported rapid growth of such services. This dissertation presents a modeling framework to study the operation of on-demand mobility services (ODMS) in urban areas. The framework can analyze the operation of ODMS while representing emerging services such as ridesharing and transfer. The problem is formulated as a mixed-integer program and an efficient decomposition-based methodology is developed for its solution. This solution methodology aims at solving the offline version of the problem, in which the passengers’ demand is assumed to be known ii for the entire planning horizon. The presented approach adopts a modified column generation algorithm, which integrates iterative decomposition and network augmentation techniques to analyze networks with moderate size. Besides, a novel methodology for integrated ride-matching and vehicle routing for dynamic (online) ODMS with ridesharing and transfer options is developed to solve the problem in real-time. The methodology adopts a hybrid heuristic approach, which enables solving large problem instances in near real-time, where the passengers’ demand is not known a priori. The heuristic allows to (1) promptly respond to individual ride requests and (2) periodically re-evaluate the generated solutions and recommend modifications to enhance the overall solution quality by increasing the number of served passengers and total profit of the system. The outcomes of experiments considering hypothetical and real-world networks are presented. The results show that the modified column generation approach provides a good quality solution in less computation time than the CPLEX solver. Additionally, the heuristic approach can provide an efficient solution for large networks while satisfying the real-time execution requirements. Additionally, investigation of the results of the experiments shows that increasing the number of passengers willing to rideshare and/or transfer increases the general performance of ODMS by increasing the number of served passengers and associated revenue and reducing the number of needed vehicles

    Cytomegalovirus Infection among Kidney Transplant Recipients One Year after Transplantation

    No full text
    Introduction: In spite of recent advances in therapeutic approaches, viral infection management continues to be a big challenge. Cytomegalovirus (CMV) infection is considered an important cause of high morbidity and mortality in kidney transplantations. In this study, we aimed to evaluate the frequency and risk factors of CMV infection in kidney recipients during the first year following kidney transplantation in Mashhad, North Eastern Iran. &nbsp; Materials & Methods: We retrospectively evaluated medical records of 247 patients undergoing kidney transplantation in Montaserie Organ Transplantation Hospital of Mashhad city during 2012 - 2015 .The patients were followed for 1-year. The data were reported by descriptive statistics (mean and standard deviation) and viral infection associated risk factors were analyzed by Logistic regression. &nbsp; Findings: During the first year following transplantation, 64 (21.9%) episodes of CMV infections were found. 28 episodes (51.8%) occurred in the first 3 months following the transplantation, 17 (31.5%) during the second 3 months, and 9 (16.7%) after the sixth month. Among the evaluated risk factors for CMV infection (gender, age, medical comorbidities and causes of renal failure), diabetes was the only statistically significant factor identified as a cause for comorbidity and renal failure, (P value<0.05). &nbsp; Discussion & Conclusion: According to our results and conclusions, allograft kidney recipients were more sensitive to develop active CMV. Appropriate prophylaxis intake, vaccination for CMV and post-transplant viral monitoring are suggested to decrease the possibility of infections in kidney recipients.
    corecore